Nonsmooth analysis and quasi-convexification in elastic energy minimization problems
نویسندگان
چکیده
منابع مشابه
Nonsmooth analysis and quasi-convexification in elastic energy minimization problems
We consider an energy minimization problem for a two-component composite with fixed volume fractions. We study two questions. The first is the dependence of the minimum energy on the constraints and parameters. The second is the rigorous justification of the method of Lagrange multipliers for this problem. We are able to treat only cases with periodic or affine boundary condition. We show that ...
متن کاملNonsmooth Analysis and Quasi-convexiication in Elastic Energy Minimization Problems
We consider an energy minimization problem for a two-component composite with xed volume fractions. We study two questions. The rst is the dependence of the minimum energy on the constraints and parameters. The second is the rigorous justi-cation of the method of Lagrange multipliers for this problem. We are able to treat only cases with periodic or aane boundary condition. We show that the con...
متن کاملProximal alternating linearized minimization for nonconvex and nonsmooth problems
We introduce a proximal alternating linearized minimization (PALM) algorithm for solving a broad class of nonconvex and nonsmooth minimization problems. Building on the powerful KurdykaLojasiewicz property, we derive a self-contained convergence analysis framework and establish that each bounded sequence generated by PALM globally converges to a critical point. Our approach allows to analyze va...
متن کاملInertial proximal alternating minimization for nonconvex and nonsmooth problems
In this paper, we study the minimization problem of the type [Formula: see text], where f and g are both nonconvex nonsmooth functions, and R is a smooth function we can choose. We present a proximal alternating minimization algorithm with inertial effect. We obtain the convergence by constructing a key function H that guarantees a sufficient decrease property of the iterates. In fact, we prove...
متن کاملTruncated Nonsmooth Newton Multigrid Methods for Simplex-Constrained Minimization Problems
We present a multigrid method for the minimization of strongly convex functionals defined on a finite product of simplices. Such problems result, for example, from the discretization of multi-component phase-field problems. Our algorithm is globally convergent, requires no regularization parameters, and achieves multigrid convergence rates. We present numerical results for the vector-valued All...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Structural Optimization
سال: 1995
ISSN: 0934-4373,1615-1488
DOI: 10.1007/bf01742594